The Logical Difference Problem for Description Logic Terminologies
نویسندگان
چکیده
We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we present a tractable algorithm which, given two terminologies and a signature, outputs a set of concepts, which can be regarded as the logical difference between the two terminologies. As a consequence, the algorithm can also decide whether they imply the same concept implications in the signature. A prototype implementation CEX of this algorithm is presented and experimental results based on distinct versions of Snomed ct, the Systematized Nomenclature of Medicine, Clinical Terms, are discussed. Finally, results regarding the relation to uniform interpolants and possible extensions to more expressive description logics are presented.
منابع مشابه
Deciding the logical difference problem for EL with role inclusions
We consider the logical difference problem for terminologies that are formulated in the lightweight description logic EL with role inclusions for role hierarchies, transitivity, and right-identity. The main result is that deciding whether two terminologies are logically different wrt. a signature can be done in ExpTime, thus it is more difficult than the subsumption problem for this logic but n...
متن کاملThe Logical Difference For Fuzzy EL+ Ontologies
Ontologies undergo changes for reasons such as changes in knowledge, meeting varying application requirements. Thus, for different versions of a considered ontology, it is important to clarify the difference between them. The difference above refers to the logical difference, not syntactic one. Examples of the logical difference include the difference in taxonomy, concept subsumption difference...
متن کاملComputing Maximally Satisfiable Terminologies for the Description Logic ALC with Cyclic Definitions
Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during...
متن کاملOn the Interaction between Inverse Features and Path-functional Dependencies in Description Logics
We investigate how inverse features can be added to a boolean complete description logic with pathfunctional dependencies in ways that avoid undecidability of the associated logical implication problem. In particular, we present two conditions that ensure the problem remains EXPTIMEcomplete. The first is syntactic in nature and limits the form that dependencies may have in argument terminologie...
متن کاملModel-based Revision Operators for Terminologies in Description Logics
The problem of revising an ontology consistently is closely related to the problem of belief revision which has been widely discussed in the literature. Some syntax-based belief revision operators have been adapted to revise ontologies in Description Logics (DLs). However, these operators remove the whole axioms to resolve logical contradictions and thus are not fine-grained. In this paper, we ...
متن کامل